k-Times Anonymous Authentication (Extended Abstract)
نویسندگان
چکیده
We propose an authentication scheme in which users can be authenticated anonymously so long as times that they are authenticated is within an allowable number. The proposed scheme has two features that allow 1) no one, not even an authority, identify users who have been authenticated within the allowable number, and that allow 2) anyone to trace, without help from the authority, dishonest users who have been authenticated beyond the allowable number by using the records of these authentications. Although identity escrow/group signature schemes allow users to be anonymously authenticated, the authorities in these schemes have the unnecessary ability to trace any user. Moreover, since it is only the authority who is able to trace users, one needs to make cumbersome inquiries to the authority to see how many times a user has been authenticated. Our scheme can be applied to e-voting, e-cash, electronic coupons, and trial browsing of content. In these applications, our scheme, unlike the previous one, conceals users’ participation from protocols and guarantees that they will remain anonymous to everyone.
منابع مشابه
Dynamic k-Times Anonymous Authentication
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has application in evoting, e-cash, electronic coupons and anonymous trial browsing of content. In this paper, we extend k-TAA model to dynamic k-TAA in which application providers can independently grant or revoke users from the...
متن کاملEfficient Dynamic k-Times Anonymous Authentication
In k-times anonymous authentication (k-TAA) schemes, members of a group can be anonymously authenticated to access applications for a bounded number of times determined by application providers. Dynamic k-TAA allows application providers to independently grant or revoke group members from accessing their applications. Dynamic kTAA can be applied in several scenarios, such as k-show anonymous cr...
متن کاملk-Times Anonymous Authentication with a Constant Proving Cost
A k-Times Anonymous Authentication (k-TAA) scheme allows users to be authenticated anonymously so long as the number of times that they are authenticated is within an allowable number. Some promising applications are e-voting, e-cash, e-coupons, and trial browsing of contents. However, the previous schemes are not efficient in the case where the allowable number k is large, since they require b...
متن کاملAnonymous Authentication: For Privacy and Security
Fundamental Security Technologies Anonymous Authentication: For Privacy and Security By Kazue SAKO,* Shoko YONEZAWA* and Isamu TERANISHI* *Internet Systems Research Laboratories This paper presents NEC’s activities on anonymous authentication. Anonymous authentication is a means of authorizing a user without identification. The technology serves as a breakthrough to enhance the privacy of the u...
متن کاملAn Efficient Anonymous Authentication Protocol in Vehicular Ad-hoc Networks
In this paper, we introduce an efficient anonymous authentication protocol in Vehicular Ad-hoc Networks (VANETs) [5] to resolve the issue on anonymous authentication for communication between roadside units and vehicles. Our proposed protocol cannot only guarantee privacy, anonymity, and other basic cryptographic requirements but also provide traceability of illegal users. Our proposed protocol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004